Programming content processing and management system and method

ABSTRACT

In accordance with aspects of the present invention, a technique is implemented to effectively receive streaming multimedia content in digital form, parse and segment the received transport stream and process the segmented content. Such treatment of received programming content provides for efficient storage of such programming content, and effectively provides for access to such content by administrators of a broadband system as well as users of such systems. In accordance with the invention, a technique enables, among other things: the creation of reference frames for, e.g., effective segmentation of programming content; encapsulation of programming content data as a UDP/IP datagram; associating programming content with provider and dedicated resource attributes; monitoring staging processor activity; effectively segmenting programming content that is scrambled; developing a unicast and multicast; compensating for missing or delayed programming content; and propagating video servers of varying manufacturers.

The present application is a continuation-in-part of U.S. applicationSer. No. 10/428,719, filed on May 1, 2003, which is acontinuation-in-part of U.S. application Ser. No. 10/263,015, filed onOct. 2, 2002 now U.S. Pat. No. 7,908,626 which claims benefit of U.S.Provisional Application No. 60/377,963, filed on May 3, 2002, all ofwhich are incorporated herein by reference.

FIELD OF THE INVENTION

The invention relates to communications systems and methods, and moreparticularly to a system and method for processing multimedia contentfor storage and retrieval in a broadband communications network.

BACKGROUND OF THE INVENTION

With the advent of interactive programming services—e.g., video ondemand (VOD), electronic program guides (EPGs), and the like—thecomplexity associated with processing and storing programming content sothat it can be effectively accessed for transmission has increased. Forexample, a VOD service provides a large number of users with the abilityto access a specific program from among a wide array of programmingcontent. In addition, some VOD services allow users to manipulate suchcontent by, e.g., fast-forwarding, rewinding, etc. such programs. In thecourse of making such VOD programming and options available to users,the content must be made available for access and viewing by a user atany given time. In addition, accommodations must be made such thatmultiple users—and at times large numbers of users—can view the sameprogramming content at the same time even though the start time of suchprogram may vary from user to user.

In addition, requests are often received to view a given program indifferent presentations. For example, a user at a set-top terminal mayrequest that a previously broadcast episode of a program be accessed andplayed. Another (or the same) user may issue a rewind command concerningthe same program, whereas another user may issue a 3-times normal playspeed fast-forward command.

Accordingly, programming content needs to be stored and processed in amanner such that a seamless viewing experience from a user's vantage iscreated (e.g., minimal delays in transmission of content, smoothtransitions between content segments of the same or different programs,etc.)—regardless of the presentation selected by the user or the numberof users accessing the same program.

Moreover, as interactive programming services have become moreubiquitous and the availability of such service continues to grow, ithas and will continue to be more challenging for broadband serviceproviders to store and maintain programming content in an effectivemanner such that administrators of such systems are capable of easilyaccessing and handling programming content data as desired.

SUMMARY OF THE INVENTION

Thus, in accordance with aspects of the present invention, a techniqueis implemented to effectively receive streaming digital multimediacontent by a headend of a broadband communications system, parse andsegment the received content and process the segmented content. Suchhandling of the received programming content provides for effectivestorage of the programming content, and effectively provides for accessto such content by administrators of the broadband communications systemas well as users of such systems.

In accordance with an embodiment of the invention, intraframes (alsocalled I-frames) are used as indicators of a location within a programstream. As a result segmentation messages that are transmitted in theprogram stream can refer to such indicators (or reference frames). Asegmentation message is data incorporated into a program stream whichprovides information relating to the programming content transmitted inthe stream. Through the creation of additional intraframes, a finertemporal resolution is generated, increasing opportunities for usingsuch intraframes for managing the program stream at desired locationswithin a given program stream. In addition, the creation of additionalintraframes also allows for increased resolution when creating trickfiles (i.e., files that, among other things, allow for contentmanipulation by users).

In accordance with another aspect of the invention, program streams maybe subdivided into substreams by categories. For example, when theheadend of a broadband communications system receives programmingcontent carried by a program stream, a processor at the headend isconfigured, in accordance with an aspect of the invention, to parse andcategorize the received content. As a result, individual substreams maybe generated by content provider name, program title, subject matter andother categories associated with the received programming content.

In accordance with another aspect of the invention, one or moreprocessors are monitored for failures or delay conditions associatedwith the receipt, processing or transmission of programming content bysuch processors.

In accordance with yet another embodiment of the invention, scrambledand descrambled content may be parsed and segmented. Insertion ofsegmentation messages in the scrambled program stream is facilitated byutilizing a descrambled copy of the scrambled content as a guide. Thecaptured content may be played back many times without furtherscrambling.

In accordance with yet another embodiment of the invention, portions ofprogramming content that are lost or whose transmission is delayed arecompensated for through, for example, the insertion of “stuffing”packets or some other pre-designated programming content. In anotheraspect of the invention, when the delay in programming contenttransmission is less than a predetermined threshold, such content isrecreated based upon received content.

In yet another embodiment of the invention, programming content isencapsulated (or repackaged) in a user datagram protocol/Internetprotocol (“UDP/IP”) datagram, thereby increasing the scalability of thestaging processor. Such increase in scalability facilitates, forexample, load balancing among a plurality of video servers.

In another embodiment of the invention, trick files are generated in aform such that these files can be transferred among various videoservers—regardless of server manufacturer—with little or no additionalprocessing resources.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 a is a block diagram of certain components of a broadbandcommunications system embodying principles of an embodiment of theinvention;

FIG. 1 b is a block diagram of certain components of the headendembodied by the broadband communications system of FIG. 1 a, inaccordance with an embodiment of the invention;

FIG. 1 c is a block diagram of the staging processor embodied by theheadend of FIG. 1 b, in accordance with an embodiment of the invention;

FIG. 1 d is a block diagram of the schedule manager embodied by theheadend of FIG. 1 b, in accordance with an embodiment of the invention;

FIG. 2 a is a schematic representation of a program stream segmentedwith segmentation messages in accordance with an embodiment of theinvention;

FIG. 2 b is an example of a content related segmentation message in aprogram stream;

FIG. 2 c is an example of rights related segmentation in a programstream;

FIG. 3 is a flowchart illustrating the process of creating referenceframes into programming content, in accordance with an embodiment of theinvention;

FIG. 4 a is a flowchart illustrating the process of associatingprogramming content with a content provider, in accordance with anembodiment of the invention;

FIG. 4 b is a table illustrating the association of data concerningprogramming content, in accordance with an embodiment of the invention;

FIG. 5 is a flowchart illustrating the process of monitoring stagingprocessor activity, in accordance with an embodiment of the invention;

FIG. 6 a is a flowchart illustrating the process of segmenting scrambledprogramming content, in accordance with an embodiment of the invention;

FIG. 6 b is a flowchart illustrating a program stream carrying scrambledcontent and a program stream carrying descrambled content, in accordancewith an embodiment of the invention;

FIG. 7 is a flowchart illustrating the process of compensating formissing or delayed programming content, in accordance with an aspect ofthe invention;

FIG. 8 is a flowchart illustrating the process of encapsulating contentsof a program stream as a UDP/IP datagram, in accordance with anembodiment of the invention;

FIG. 9 is a block diagram of certain components of the headend embodiedby the broadband communications system of FIG. 1 a, in accordance withanother embodiment of the invention; and

FIG. 10 is a block diagram illustrating the configuration of multiplemedia processors and multiple segmentation processors utilized by thebroadband communications system of FIG. 1 a, in accordance with anembodiment of the invention.

DETAILED DESCRIPTION

In accordance with aspects of the present invention, a technique isimplemented to effectively receive streaming multimedia content indigital form, parse and segment the received program stream and processthe segmented content for effective storage of such programming contentand for effectively providing access to such content by administratorsof a broadband communication system as well as users of such systems.

The inventive technique enables, among other things: the creation ofreference frames for, e.g., effective segmentation of programmingcontent; encapsulation of programming content data as a user datagramprotocol/Internet protocol (“UDP/IP”) datagram; associating programmingcontent with provider and dedicated resource attributes (contentmetadata); monitoring staging processor activity; effectively segmentingprogramming content that is scrambled; developing a unicast andmulticast; compensating for missing or delayed programming content; andpropagating video servers of varying manufacturers. These and otherfunctionalities are described below in detail.

The Broadband Communications System

FIG. 1 a is a block diagram of a broadband communications system 10embodying principles of the invention. The system includes one or moreprogram sources 12, and cable system 14 which includes a plurality ofservice area nodes 16-1 through 16-P in a neighborhood, where Prepresents an integer. Service area node 16-1, for example, is coupledto set-top terminals 18-1 through 18-M, where M is an integer, atcustomer's TV's. Information and entertainment services is delivered toset-top terminals 18-1 through 18-M.

Sources 12 create and deliver programming to cable system 14 through anorigination system 20. Sources 12 may include analog and digitalsatellite sources that typically provide the traditional forms oftelevision broadcast programs and information services. Sources 12 mayalso include terrestrial broadcasters, such as broadcast networks (CBS,NBC, ABC, etc., for example), which typically transmit content from oneground antenna to another ground antenna and/or via cable or fiber.Sources 12 may further include application servers, which typicallyprovide executable code and data for application specific services suchas database services, network management services, transactionalelectronic commerce services, system administration console services,application specific services (such as stock ticker, sports ticker,weather and interactive program guide data), resource managementservice, connection management services, subscriber cares services,billing services, operation system services, and object managementservices; and media servers, which provide time-critical media assetssuch as Moving Pictures Experts Group 2 (“MPEG-2”) standard encodedvideo and audio, MPEG-2 encoded still images, bit-mapped graphic images,PCM digital audio, three dimensional graphic objects, applicationprograms, application data files, etc. Although specific examples ofprograms and services which may be provided by the aforementionedsources are given herein, other programs and services may also beprovided by these or other sources without departing from the spirit andscope of the invention.

Cable system 14 includes headend 22, which processes program materials,such as TV program streams, for example, from sources 12 in digital andanalog forms. Digital TV program streams may be formatted according toMotorola Digicipher System, Scientific Atlanta Powerview Systems, theDigital Satellite System (DSS), Digital Broadcast Services (DBS), orAdvanced Television Standards Committee (ATSC) standards, for example.Analog TV program streams may be formatted according to the NationalTelevision Standards Committee (NTSC) or Phase Alternating Line (PAL)broadcast standard. Headend 22 extracts program content in the analogand digital TV program streams and formats the content, as required, toform one or more MPEG-2 encoded transport streams for transmission tousers, e.g., at set-top terminals 18-1 through 18-M. For example, othervideo codecs (coder/decoders) may be applied. Such reformatting may beapplied to those received streams already in an MPEG-2 format. Thisstems from the fact that the MPEG-2 formatted digital content in thereceived streams are typically encoded at a variable bit rate (VBR). Toavoid data burstiness and to allow for simple remultiplexing, headend 22may re-encode such digital content at a constant bit rate (CBR) to formtransport streams in a conventional manner.

Typically, the transmission of data to, for example, hub 24 requiresprocessing at each hub to requantize and convert the content to a CBR.By converting the content at headend 22, however, the need for a CBR toVBR conversion at hub 24 is obviated. Because a typical cable systemtends to utilize a larger number of hubs than headends, the processingof the content at headend 22, rather than hub 24, reduces the number ofCBR to VBR conversions and therefore reduces the processing resourcesused by system 10.

In addition, by converting received content to CBR at the headend 22,the storing of such content onto one or more of video servers 190-1through 190-N becomes more predictable and therefore manageable. This isaccomplished because the rate in which content is transmitted to videoservers 190-1 through 190-N is set at a constant rate (e.g. 3.75MB/second). Thus, because the processing rate is constant, the time forstoring program at a predetermined CBR onto one or more of video servers190-1 through 190-N may be calculated in advance of such storage.

The generated transport streams are typically transmitted from headend22 to hub 24 via Internet Protocol (“IP”) transport over optical fiber.The transport streams may also be transmitted as intermediate frequencysignals that have been amplitude modulated (“AM”) or as a digital videobroadcast (DVB) a synchronous serial interface (ASI) that has also beenAM modulated. Hub 24 includes modulator bank 26, among other components.Modulator bank 26 includes multiple modulators, each of which is used tomodulate transport streams onto different carriers. Hub 24 is connectedto hybrid fiber/coax (HFC) cable network 28, which is connected toservice area nodes 16-1 through 16-P. The transport streams may berecorded in headend 22 so that the users at the set-top terminals maymanipulate (e.g., pause, fast-forward or rewind) the programming contentin the recorded transport streams in a manner described in co-pending,commonly assigned application Ser. No. 10/263,015 (“the '015application”), filed Oct. 2, 2002, for example, which is incorporated byreference herein. In addition, in accordance with an embodiment of theinvention, the transport streams are processed and stored in headend 22based, at least in part, on segmentation messages, as described furtherbelow and in a manner further described in co-pending, commonly-assignedapplication Ser. No. 10/428,719, hereby incorporated by reference.

The Headend

FIG. 1 b is a block diagram of certain components of headend 22 by thebroadband communications system 10 of FIG. 1 a, in accordance with anembodiment of the invention. Headend 22 includes staging processor 107which is in communication with, among others, receiver 105, elementmanagement interface (EMI) 120, schedule manager 155, video servers190-1 to 190-N (for example, VOD servers), where N is an integer, andasset storage 103, as illustrated in FIG. 1 b. It should be noted thatthe video servers 190-1 to 190-N may be the same manufacturer and model,thereby having the same specification, or may be of differentmanufacturers and specifications. Thus one server may have differentcharacteristics (such as reliability, processing speed or outputcapability) than one or more of the other video servers. Receiver 105receives programming content from origination system 20 and is thesource of the transport stream (which in this case is in MPEG-2 format)processed by the staging processor 107. Output from receiver 105 may becompliant with one or more standards, including Digital HeadendInterface (DHEI), Digital Video Broadcasting-Asynchronous SerialInterface (DVB-ASI), 10/100 baseT, or the like. Staging processor 107has a plurality of output ports (109-1 through 109-N), as shown in FIG.1 c, for transmission of received and segmented programming content tovideo servers 190-1 through 190-N (shown in FIG. 1 b).

EMI 120 is responsible for performing static configuration andmonitoring of staging processor 107. As described below, EMI 120, amongother things, labels content delivered by a provider (e.g., “HBO”,“NBC,” etc.) to staging processor 107 from receiver 105. EMI 120 alsoconfigures mapping of input services to specific output internetprotocol (IP) addresses and user datagram protocol/Internet protocol(UDP/IP) port numbers for use in switched video digital broadcasting. Anexample of such broadcasting is described in International PublicationNumber WO 03/026274 A2, and is incorporated herein by reference. Inaddition, as described below, EMI 120 monitors staging processor 107 andschedule manager 155 to ensure that these components are active whensuch state is desired and that such components are operating properly.

As illustrated by FIG. 1 c, staging processor 107 includes memory 21,central processing unit (CPU) 23 and interface 25. Staging processor 107and schedule manager 155 share a common time reference which allowstheir communication to follow a contemporaneous timeline. This may beaccomplished by, for example, the provision of a system clock (notshown) residing in headend 22 with which staging processor 107 andschedule manager 155 are synchronized.

Schedule manager 155 (which includes memory 74, CPU 76 and interface 78,as illustrated in FIG. 1 d) is configured for determining if aparticular program should be extracted from a program stream received bystaging processor 107 and for providing instructions to stagingprocessor 107 in accordance with one or more business rules relating tofurther processing of parsed programming content. These business rules,which are described in detail below, are stored in business rules module77 of schedule manager memory 74.

Thus, if a program is to be captured as a content object, schedulemanager 155 creates a content object which may then reference a titlethat may be ultimately stored on a video server 190 (such as a VODserver), or some other short term or long term storage device. Stagingprocessor 107 segments program streams based on the segmentationmessages in the program stream and externally provided program scheduleinformation, under the control of schedule manager 155.

Program schedule information may be provided to schedule manager 155 byan electronic program guide (“EPG”) data server (not shown) in the formof a program guide data tables that include a program identificationcode (“PIC”) and the scheduled program start and end times for eachprogram. The transport stream carrying program guide data is typicallyprovided by a third party that aggregates program scheduling informationfrom a plurality of sources. The program guide in the data stream may bestored in schedule manager memory 74 or other such memory in headend 22.

Segmentation of Video of a Program Stream

FIG. 2 a is a schematic representation of a program stream 100, carryingvideo information, segmented with segmentation messages in accordancewith an embodiment of the invention. The program start and program endsegmentation messages in the transport stream 102 provide more preciseprogram start and end times than those provided in the stored programguide data. The transport stream carrying program guide data typicallydoes not provide any information about program portions, such aschapters or advertisements.

Program stream 100 includes a plurality of TV programs, including TVprogram 102. Portions of TV program 104 preceding TV program 102 and TVprogram 106 following TV program 102 are shown, as well. TV program 102starts at point 107 a and ends at point 107 b. TV program 102 mayinclude chapter 108, such as a monolog, skit, musical performance, guestappearance, sports highlight, interview, weather report, and innings ofa baseball game, for example. Chapter 108 starts at point 108 a and endsat point 108 b. A network commercial 110 and a local commercial 112 arealso included within the expanse of program 102, with respective startand end points 110 a, 110 b, 112 a, 112 b. Unscheduled content 132 isindicated, with start and end times 132 a, 132 b, respectively, torepresent an overrun of a program, such as overtime in a sports event,for example. Unscheduled content 132 could also be news bulletin.Unscheduled content 132 may or may not be present in a particularprogram or program stream. A TV program may contain more or fewerchapters 108, network commercials 110 and local commercials 112.Content-related segmentation messages 114, 116, 118, 120, 122, 124, 126,128, 134 and 136 in accordance with an embodiment of the invention arealso included in stream 100.

Segmentation message 114, which may be referred to as a program startmessage, indicates that TV program 102 will start in A seconds from thetime of the appearance of that message. The time period may be definedin segmentation message 114. Segmentation message 114 may also include aPIC that uniquely identifies the program. Other PICs may be used toidentify other program segments, such as chapters or advertising. Otherinformation, such as rights-related information, may be provided insegmentation message 114, as well. For example, the rights informationmay indicate whether there is a right to copy and store program 102 incable system 14 for later retrieval. FIG. 2 b is an example of asegmentation message, such as segmentation message 114, in programstream 100. Segmentation message 114 includes PIC field 152,rights-related information field 154 and time until event field 156,which here indicates the time until the start of program 102.

Instead of including rights information in segmentation message 114, itmay be provided in a separate message 115, as shown in FIG. 2 c. Rightsmessage 115 may have a similar configuration as segmentation message 114of FIG. 2 b, except that time to event field 156 is not needed. PICfield 158, and two rights fields 160, 162 are shown. More or fewerrights fields may be provided, depending on the number of rights thatneed to be defined.

Content and rights-related segmentation messages may be formatted inaccordance with, for example, the DVS-253 (ANSI/SCTE 35 2001) cueingstandard for, for example, digital advertisement insertion. Asegmentation message may be in the form of a packet delineated by a syncbyte, which is a byte that is unlikely to be replicated in the programstream. The fields discussed above may follow the sync byte, separatedby commas. Segmentation messages may be provided over a single channelfor all programs in the multiplex.

Returning to FIG. 2 a, another rights-related segmentation message 117is provided after start 107 a of program 102. It may be useful toprovide a rights message within the expanse of the program or programportion to which the right relates, in addition to or instead ofproviding rights-related segmentation message 115 prior to the start ofprogram 102. If both rights-related segmentation message 115 and 117 areprovided, different types of rights information may be provided in each.For example, the right to copy program 102 may be included insegmentation message 115, so that headend 22 will know prior to thearrival of program 102 whether or not program 102 may be processed forstorage. Other types of rights, such as the right to store the programfor a limited period of time, which is useful information to have accessto after program 102 is stored, may be provided within the expanse ofprogram 102, in rights segmentation message 117. Other rights related tothe use of the stored program may also be more advantageously storedwithin the expanse of program 102 in message 117. Messages may betransmitted for increased robustness.

Segmentation message 136, which may be referred to as a program endmessage, indicates that TV program 102 will end in B seconds from theappearance of message 136. The program identification code, and anyother desired information, may be included in the message, as well.

Segmentation message 116, which may be referred to as a chapter startmessage, indicates that a chapter will start in C seconds from theappearance of message 116. A PIC field and a field for an identificationcode for chapter 108 may be included in the message. A rightsinformation field may also be incorporated in segmentation message 118or in a separate rights segmentation message 119 within the expanse ofchapter 108, particularly if chapter 108 has different rights associatedwith it than the rights associated with program 102. Segmentationmessage 118, which may be referred to as a chapter end message,indicates that chapter 108 will end in D seconds from the appearance ofmessage 118.

Segmentation message 120, which may be referred to as a networkadvertising start message, indicates that network advertising will startin E seconds from the appearance of message 120. A PIC field and a fieldfor an identification code for that segment of advertising may beincluded in segmentation message 120, as well. Rights information, ifany, which may relate to that advertising segment, may be included insegmentation message 120 or in a separate segmentation message (notshown) associated with advertising segment 110. For example, contractualobligations with respect to program 102 may require that the advertisingsegment 110 be included whenever program 102 is broadcast.Alternatively, the right to delete or replace advertising may begranted. Providing such information in segmentation message 120 or in aseparate segmentation message associated with the advertising segment110, facilitates correct processing of program 102 for storage andassists in ensuring that rights obligations are met. Segmentationmessage 122, which may be referred to as a network advertising endmessage, indicates that the network advertising will end in F secondsfrom the appearance of message 122.

Segmentation message 124, which may be referred to as a localadvertising start message, indicates that local advertising will occurin G seconds from the appearance of message 124. A PIC field and a fieldfor an identification code for that segment of local advertising, may beincluded in segmentation message 120, as well. As above, rightsinformation relating to that segment of local advertising may also beprovided in segmentation message 124 or in another segmentation messageassociated with local advertising segment 112. Segmentation message 126,which may be referred to as a local advertising end message, indicatesthat that break will end in H seconds from the appearance of message126. Advertising is typically included in program stream 100 as providedby a source 12 in the expanse 112, indicated by the local advertisingstart and local advertising end messages 124, 126. Cable system 14 mayinsert local advertising into the program stream, replacing theadvertising originally provided by a source 12. Cable system 14 may usesegmentation messages 124, 126 to determine when to start insertion ofthe local advertising and when to return to the program stream 100. Theadvertising may be inserted at the headend 22 or at set-top terminals18-1 through 18-M, as discussed further below.

If program 102 extends beyond its expected end time (such as if program102 is a sporting event going into overtime, for example), anunscheduled content start segmentation message 128 may be provided, toindicate the start of unscheduled content 132 in I seconds. A PIC fieldand a field for an identification code for the unscheduled content mayalso be included. Rights information may be included, as well.

If the unscheduled content is overtime in a sporting event, for example,the unscheduled content ends at the end 107 b of program 102. Programend segmentation message 136 may indicate the end of both program 102and unscheduled content 132 or an unscheduled content end segmentationmessage 134 may be provided.

If the unscheduled content is a news bulletin, for example, it may endprior to the end of program 102. An unscheduled content end message 134is then preferably provided to indicate the end of that content.

After the unscheduled content is completed, program 102 may continue tobe broadcast at the point where the program was interrupted. In thatcase, the entire program 102 is broadcast. However, program 102 may thenrun over the scheduled end time. The unscheduled content end message 134will indicate when the unscheduled content ends. Alternatively, if theprogress of program 102 continues while the unscheduled content is beingbroadcast, program 102 will end on time, but part of program 102 willnot be shown to the viewer. Cable system 14 may want to warn the viewerthat a portion of the show is being pre-empted or will run over thescheduled end time. In addition, whether a program has been pre-emptedmay affect treatment as a stored asset for later retrieval. For example,users may be notified that the program was not broadcast in its entiretyand the requested program will not be complete. If the pre-emption isdue to a news bulletin, the bulletin may be stored as a separate asset,as well. It may therefore be useful to include information indicatingwhether a portion of program 102 is pre-empted so that program 102 endson time or that program 102 is not pre-empted and will run over thescheduled end time, in unscheduled content segmentation message 128 orin another segmentation message.

The A through I time periods referred to above are real numbers. Timeperiods A through I each may be 6 seconds, for example. Other timeperiods may be used and different time periods may be used for differentsegmentation messages. Alternatively, it may be previously defined thatall segmentation messages, or segmentation messages of certain types,indicate a predetermined time period until the occurrence of the event.

Both ends of a program or a program portion (such as chapter 108), arepreferably indicated by separate segmentation messages. Alternatively,both the time until a start of a program or program portion and the timeuntil the end of that program or program portion may be indicated in thesame segmentation message. For example, in segmentation message 114 inFIG. 2 b, where Time to Event field 156 indicates the time until thestart of program 102, an additional field may be provided to indicatethe time until the end of program 102 and/or the duration of theprogram. Such a segmentation message should be positioned prior to thestart of the respective program or program portion. Both a program startsegmentation message including a time to end or duration of a programand program end segmentation message 136 may be provided for redundancy,as well.

As shown in FIG. 2 a, expanses may exist within other expanses. Forexample, together, a program start message 114 and a program end message136 define an expanse of the entire program 102. Program start and endmessages for chapter 108, network advertising 110 and local advertising112 define expanses of the respective program portions within theexpanse of program 102. If any portion of a program has a start messagewithout a corresponding end message, program end message 136 terminatesall segments without their own end message. If a chapter oradvertisement portion is the beginning of a program, a correspondingstart message preferably accompanies the program start message, anddefines the same boundary time. As mentioned above, a program endmessage 136 can terminate unscheduled content segment 132.

In accordance with another embodiment, segmentation messages may be sentmultiple times or periodically, for redundancy. Since errors in definingthe start 107 a and end 107 b of program 102 could result in storage ofan incomplete program or storage of one program including a portion ofanother program, the program start and program end messages 114, 128,and other such significant segmentation messages, are preferably senttwo or more times prior to the event boundary. For example, the programstart message 114 and the program end message 136 may be sent twicewithin a 5 to 8 second window prior to the respective boundary.Advertising segmentation messages, particularly those defining anexpanse of local advertising, where cable system 14 may insert their ownadvertising, are also preferably sent multiple times, because missing anadvertising insertion point could adversely impact advertising revenue.Messages may be sent minutes before the boundary as well.

Another important segmentation message that may be repeated are theunscheduled content start message 128 and the unscheduled content endmessage 134. Since the unscheduled content may extend beyond thescheduled end time of program 102, it is important for the cable companyto know this as soon as possible. The exact end time of the unscheduledcontent may not be known but the end message can indicate an expectedtime to end of content in the message. The value of the expected time toend of content may become more accurate as the unscheduled contentprogresses towards its conclusion, and the segmentation messages mayreflect this developing accuracy.

For further redundancy, the messages may be sent periodically throughouta program or program portion. For example, a segmentation message toindicate an event may be sent every minute starting from the start of aprior event. As an event is approached, the time period between messagesmay become shorter. For example, messages may be sent every minute untilthe boundary is 1 minute away. Then the messages may be sent every 10seconds or more frequently. Segmentation messages may also be providedwithin one or more prior portions to indicate an event in a subsequentportion. For example, in program stream 100, national advertising startmessages 120 may appear one or more times within chapter 108 or evenbefore the start of chapter 108 in the program stream.

If two segmentation messages received at different times indicatedifferent event times, the time of the segmentation message arrivinglast is considered to be more accurate. It may, for example, reflect anunanticipated change in the end time of a program, such as overtime orpostponement of a commercial in a sports event.

Other segmentation messages that may be provided include a table of allof the segmentation points in a program. A segmentation point is a placein a transport stream in which a content provider can insert asegmentation message. Tables of particular types of segmentationmessages or all of the segmentation messages may also be embedded inprogram stream 100. For example, a table of each type of advertising(national and local, for example) in a program may be provided.Additional information may be provided in the segmentation message toidentify a commercial sponsor of respective advertising to assist cablesystem 14 in inserting appropriate advertising. For example, if thesegmentation message includes an indication that a national ad that mustbe broadcast is for a soda company (Coca Cola, for example), then acable system 14 can more readily avoid placement of an advertisement fora second soda company (Pepsi, for example), in a local ad spot inproximity to the ad for the first soda company, which may be acontractual obligation of cable system 14. Receipt of such informationin a table at the beginning of a program or prior to that, allows cablesystem 14 time to plan for ad placement in the program. Providing allsegmentation messages in a table in program stream 100 at the beginningof a program or prior to that would give cable system 100 more time toplan for other events, as well.

Another segmentation message that may be provided is a message toindicate that a scheduled program is being replaced by source 12, or maybe replaced by cable system 14, by substitute programming. For example,if a sporting event is cancelled due to rain, source 12 may providesubstitute programming and the cable company may have the option ofproviding its own substitute programming. A segmentation message may beprovided as part of program start message 114 or prior to it, toindicate that substitute programming follows, and to identify theprogramming.

Creation of Trick Files

Processor 107 is further configured to create, in real-time, trick filesassociated with, for example, program 102 as part of the asset which areused to perform trick mode functions (e.g., rewinding andfast-forwarding) on program 102. One such trick file in this instance isa “fast-forward” trick file which contains an array of identifiers ofintra-coded frames (or I-frames) in the program stream (MPEG-2 encodedas mentioned before) corresponding to program 102 in a forwarddirection. I-frames, also called intra-frames, is one of three types ofvideo frame used in MPEG video compression. The other two frame typesare forward predicted frames (P-frames) and bi-directional predictedframes (B-frames).

An I-frame is encoded as a single image, with no reference to any pastor future frames. The encoding scheme used is similar to JPEGcompression. A P-frame is encoded relative to the past reference frame.A reference frame is a P- or I-frame. The past reference frame is theclosest preceding reference frame. Each macroblock in a P-frame can beencoded either as an I-macroblock or as a P-macroblock. A B-frame isencoded relative to the past reference frame, the future referenceframe, or both frames. The future reference frame is the closestfollowing reference frame (I or P). The encoding for B-frames is similarto P-frames, except that motion vectors may refer to areas in the futurereference frames.

Another trick file is a “rewind” trick file which contains an array ofidentifiers of I-frames in the program stream corresponding to program102 in the reverse direction. The I-frame identifiers in the trick filesare used as indices or markers for rewinding and fast-forwarding ofprogram 102. It should be noted that not all of the I-frames associatedwith program 102 are selected for the trick files. Rather, the I-framesare selected periodically along the program stream. Thus, the shorterthe period is, the closer the instants from which program 102 can berewound, and to which program 102 can be fast-forwarded, therebyachieving finer adjustments.

It should also be noted that, in accordance with an alternativeembodiment of the invention, one trick file can support bothfast-forward and rewind commands that are received by a user. In suchcase, the trick file contains an array of identifiers of I-frames in theprogram stream corresponding to program 102 in, for example, a forwarddirection. If a fast-forward command is received, the selectedidentifiers corresponding to periodic display of the program stream areaccessed in a forward order, thereby presenting a fast-forward displayto the user. If, however, a rewind command is received, the selectedidentifiers are accessed in the reverse order, thereby presenting arewind display to the user.

In the event that program 102 is pre-staged, the program content comeswith the corresponding metadata file and trick files associated with theprogram. Processor 107 stores the created or pre-staged asset includingthe metadata file and trick files associated with a program according toits program designation in asset storage 103.

The access of such files for manipulation of programming content isfully described in the '015 application, incorporated herein byreference.

As described above, trick files are generated and stored by components(i.e., staging processor 107 and asset storage 103) that are typicallyaccessible to a plurality of video servers—e.g., video servers 190-1 to190-N. Thus, if the trick files comprise I-frames (or other frame types,such as P-frames) that can be universally processed by each of videoservers 190-1 to 190-N, trick file content need not be regenerated orreformatted based upon the formatting requirements of each differentvideo server.

Thus, in accordance with an embodiment of the invention, trick filescomprise, for example, I-frames that are formatted in a universalformat—i.e., a format that can be processed by various types of servers(e.g., servers of different manufacturers or model type). For example,the universal format may comprise I-frames having headers which includeinformation relating to the type, length and value structure of eachrespective frame. The type field is a unique identifier for the I-frame,the length field specifies the length of the data and the value fieldcontains a variable length of data bytes. In addition, the universalformat contains pointers into key locations of the MPEG-2 programstream.

Thus, in accordance with an embodiment of the invention, a trick-modefile can contain a subset of a received MPEG-2 stream which is generatedby performing temporal decimation of the original video file. As aresult, the normal playback of such a file simulates trick-modeoperations.

By formatting the I-frames in a universal format, files containing theseframes may then be stored on one or more servers 190-1 through 190-N (inaddition to or instead of asset storage 103) with further formatting orprocessing. In addition, by generating such trick files in a universalformat, no additional processing resources are required to reformat thetrick files when accessed by one or more video servers 190-1 through190-N. Accordingly, the need to reformat trick files when accessed byvideo servers of varying manufacturers is obviated.

In addition, no additional processing is required when trick fileprogramming content is transferred among servers. For example, if videoserver 190-1 is storing programming content and is reaching itscapacity, a portion of the programming content stored by video server190-1 may be transferred to video server 190-2 without the need toreformat such content.

In accordance with an embodiment of the invention, staging processor 107generates trick files for received MPEG content, by processing thecontent at the MPEG video stream level (rather than, for example, theelementary stream level). At this point, staging processor 107 is ableto convert the received content from VBR to CBR (as described above)and/or generate I-frames associated with such content.

As a result, once such trick files are generated by staging processor107, video servers 190-1 through 190-N do not have to perform anyformatting itself—these servers only pump out the received content.Accordingly, the burden of processing these trick files is removed fromvideo servers 190-1 through 190-N.

Increasing Segmentation Resolution by Creation of Reference Frames

As described above, programming content is received and temporarilystored as a program stream in MPEG-2 format by staging processor memory21. In accordance with the MPEG-2 standard, video data that makes up theprogramming content is compressed based on a sequence of groups ofpictures (“GOPs”), in which each GOP typically begins with anintra-coded picture frame (I-frame), which is obtained by spatiallycompressing a complete picture using discrete cosine transform (DCT). Asa result, if an error or a channel switch occurs, it is possible toresume correct decoding at the next I-frame.

Typically, the GOP may represent up to 15 additional frames—i.e.,P-frames (predicted frames) and B-frames (bi-directional frames)—byproviding a much smaller block of digital data that indicates how smallportions of the I-frame, referred to as macroblocks, move over time.

P-frames are coded as differences between the current frame and the lastI-frame or P-frame. Each macroblock in the two frames is compared and ifthey match, motion vectors are calculated to create a frame that storesonly significant differences, again compressed using the DCT algorithm.

B-frames are similar to P-frames but compare both the preceding and thesubsequent I-frame or P-frame data. The B-frames store the average ofmatching macroblocks or motion vectors. Because they are encoded basedon both preceding and subsequent data, they are more effective atstoring and displaying motion.

I-frames are encoded for spatial redundancy, and P-frames and B-framesare encoded for temporal redundancy. There are a number of differentstructures, but a common one is 15 frames as:IBBPBBPBBPBBPBB.  (α)

In addition to the I-, B- and P-frames, program streams comprisesegmentation messages which, as described above, are used for providinginformation relating to the programming content transmitted in thestream.

In accordance with an embodiment of the invention, an I-frame may beused as a “reference frame”—i.e., an indicator to a location in theprogram stream to which a segmentation message refers when fulfillingthe requirements of the message. Thus, for example, if a segmentationmessage contains information for the insertion of a blank screen forone-half second at let's say the end of program 102 (FIG. 2 a), it isdesirable to insert a reference frame such that the message can identifythe desired point in the stream in which the blank screen is to beinserted.

Placement of a reference frame affects the location within the programin which a segmentation message instruction is fulfilled, in this caseinsertion of a blank screen. Thus, increased frequency of such referenceframes may be desirable to increase the availability of points withinthe program stream for effectuating a segmentation message instruction.Such capability enables the content provider and the cable serviceprovider to have effective control over the management of the programstream.

In accordance with an embodiment of the invention, I-frames (which arealso known as intra-coded picture frames or intraframes (and are usedherein interchangeably)) serve as reference frames. As a result, inaccordance with an embodiment of the invention, staging processor 107 isconfigured with the capability of creating additional intraframes inreceived programming content. By creating these additional intraframes,staging processor 107 achieves a finer temporal resolution. In otherwords, by including intraframes, opportunities increase for utilizingsuch intraframes for managing the program stream at desired locationswithin the stream.

The creation of additional intraframes, not only provides increasedresolution for managing content, but also for creating trick files asdescribed above.

In accordance with an embodiment of the invention, additional I-framesmay be generated by staging processor CPU 23 to provide a finer temporalresolution. This may be accomplished by configuring staging processorCPU 23 to process B-frames and P-frames that are received in the programstream to further encode the GOP resulting in an increase of I-frames.

Thus, suppose in GOP α provided above, it is desirable to create anadditional intraframe at the position in between the first B-frame andthe second B-frame. Accordingly, staging processor CPU 23 constructs anew I-frame (e.g., I′) immediately after the first B-frame. A highfidelity technique is implemented to re-encode the subsequent P-framesand B-frames of the GOP in light of new I-frame, I′. As a result, a newGOP structure is formed. The resulting GOP structure, in this example,may look like this:IBI′IP′B′B′P′B′B′P′B′B′P′B′B′P′B′B′,  (β)where B′ and P′ represent new B-frames and P-frames different from thosein GOP a subjected to the requantization and high fidelity re-encodingdescribed below.

To create GOP β, the high fidelity technique involves the followingsteps and transient sequences (1) through (4). In the first step, I′ isconstructed from the current B-frame, the preceding I-frame and B-frame,and the ensuing P-frame, resulting in the following transient sequence:IBI′.  (1)

In the second step, a new P-frame (P′) is generated using the newI-frame (I′), resulting in the following transient sequence:IBI′P′.  (2)

In the third step, the new P-frame is used to generate another P-frame,resulting in the following transient sequence:IBI′P′P′.  (3)

In the fourth step, two new B-frames (B′B′) are generated and arelocated between the two new P-frames (P′P′), resulting in the followingtransient sequence:IBI′P′B′B′P′.  (4)

These steps of creating new I-, P- and B-frames are repeated until theend of the GOP is reached.

Staging processor CPU 23 then applies a well known requantizationtechnique to the subsequent P-frame (P′) and subsequent B-frames (B′) toensure that the change to the GOP's does not overflow a video bufferverifier (VBV). The VBV is a model hypothetical decoder buffer thatprevents overflowing and underflowing when the decoder is fed a programstream carrying MPEG-2 formatted content. Thus, the VBV is a MPEGstandard that helps ensure that the program stream does not exceed thebuffer on an MPEG decoder.

As is well known in the art, the requantization technique achievesbit-rate reduction of encoded video by re-quantizing DCT coefficientswith a larger quantization step size. As a result, more DCT coefficientsbecome zero, in turn requiring fewer variable length codes (VLC) toencode the re-quantized coefficients.

FIG. 3 illustrates a flowchart for increasing resolution of a programstream by creating reference frames. Such a procedure may be implementedif, for example, finer resolution for the placement of segmentationboundaries is desired or if an increase in trick file resolution isdesired. At step 310, programming content is received and temporarilystored as a program stream in MPEG-2 format by staging processor memory21. Upon receiving programming content, staging processor CPU 23determines whether increased temporal resolution of the programmingcontent received at headend 22 is desired (step 320). If stagingprocessor CPU 76 determines that no intraframe resolution refinement isdesired, then the received content is processed without further encodingat the GOP level (step 330).

If, however, increased resolution is desired, then staging processor CPU23 reads the encoded transport stream at the GOP level (step 340).Staging processor CPU 23, at step 350, then processes the precedingB-frames and P-frames from the received GOP to create additionalI-frames. Staging processor CPU 23 also re-encodes subsequent P-frameswithin the GOP based on the current frame and the newly created I-frame(e.g., I′). In addition CPU 23 re-encodes subsequent B-frames bycomparing both the preceding and the subsequent I-frame or P-frame data(step 360). These steps re-encode, for example, GOP α provided above togenerate, for example, the resulting GOP β provided above.

Allocation of Programming Content

Transport streams carrying content relating to multiple programstypically received from, e.g., origination system 20, comprise largeamounts of programming content, including an audio substream, a videosubstream, and a data substream. To more effectively handle the volumeof programming content that is carried by such a transport stream andreceived by staging processor 107, EMI 120 is configured, in accordancewith an aspect of the invention, to categorize the data that makes up agiven program stream or substreams upon receipt.

FIG. 4 a is a flowchart illustrating the process of associatingprogramming content with a content provider, in accordance with anembodiment of the invention. Suppose a program stream is received atheadend 22 (step 410). In accordance with an embodiment of theinvention, EMI 120 is configured to read the PIC associated with thedata packets that make up the received program stream or substream(s)(step 420) and to access a lookup table (e.g., table 400 of FIG. 4 b)stored by schedule manager 155 for access by EMI 120 to identify theprovider of the transmitted content (e.g., HBO, NBC, CNN, etc.) (step430). In an embodiment of the invention, the information that is storedin table 400 is sent by the content providers.

Thus, suppose a data packet is received bearing a PIC (field 462) with avalue of 001000, look-up table 400 is accessed by EMI 120 and additionalinformation relating to the identified programming content is accessed.For example, as illustrated in table 400, record 461 indicates that adata packet having a PIC with the value of 001000 relates to programmingcontent having the program title (field 464) “Friends,” provided bycontent provider (field 466) “NBC,” and relating to a subject matter(field 468) designated a “comedy.” Thus, in accordance with this aspectof the invention, the transport stream carries a category designationthat is associated with the program stream and/or substreams carryingprogramming content.

As a result, upon identifying the provider of the transmitted content,staging processor CPU 23 categorizes the data packets, in this example,by provider name (step 440) and a new substream is generated whichcomprises the video, audio, data components of programming contentrelating to that provider (step 450). Such organization may be generatedto provide ease of use to, for example, an administrator of cable system14.

Transport streams carrying content concerning a single program may begenerated by staging processor CPU 23 in accordance with parametersother than content provider name (field 466). Rather, program title(field 464), subject matter (field 468), or the like may be categoriesused by staging processor 23 to generate respective program streamsand/or substreams with such designated category as instructed byschedule manager 155. This designation enables an administrator of thecable service provider to generate and subsequently identify a desiredprogram stream containing content relating to a specific program,program title, content provider, subject matter, or the like, based onthe categorization fields 462, 464, 466, 468 shown in FIG. 4 b, or thelike.

In addition to communicating with EMI 120 to categorize programmingcontent and generating substreams relating thereto, staging processor107 is also configured, in accordance with an embodiment of theinvention, to direct programming content to one or more of its outputports 109-1 through 109-N via staging processor interface 25 in anintelligent manner. Programming content that is categorized by stagingprocessor 107 is output over, for example, these Gigabit Ethernet (GigE)ports 109-1 through 109-N (see FIG. 1 c) in streaming form for switchingdigital broadcast delivery and, as described below, is assigned to aspecified port of staging processor 107 for downstream transmission.

Thus, in accordance with an embodiment of the invention, stagingprocessor 107 is configured to monitor the number of output ports thatare active and the identity of such ports, as well as the volume ofprogramming content that is directed to each port. As subsequentprogramming content is received by headend 22, staging processor 107then determines which output port(s) should receive the streamingcontent based upon certain business rules provided by business rulemodule 77 of scheduling manager memory 74.

For example, reducing congestion is one of the business rules that isstored in business rules module 77 of schedule manager memory 74. Thus,staging processor 107 may be instructed to reduce congestion among theactive output ports 109-1 through 109-N. In accordance with anembodiment of the invention, when this business rule is promulgated bythe administrator of cable system 14, streaming programming content isdirected among each of the active output ports—e.g., ports 109-1 through109-N—in a balanced or close to balanced fashion. In such an embodiment,streaming content is transmitted through interface 25 of stagingprocessor 107, for a predetermined length of time, to the active outputport that least recently received programming content. The amount ofdata being transmitted to each port 109-1 through 109-N is monitored bystaging processor CPU 23 so that the load handled by these ports can bebalanced. In accordance with an embodiment of the invention, schedulemanager 155 provides the programming schedule to staging processor CPU23. When programming content relating to a give program is transmittedfrom schedule manager 155 to staging processor 107, CPU 23 firstdetermines whether any of its ports 109-1 through 109-N are free toreceive and transmit the content. If no port is available, it determineswhich active port was the last to be assigned programming content andthen forwards the newly received content to such port.

Processing programming content of one or more predetermined contentproviders is one of the business rules that is stored in business rulesmodule 77 of scheduling manager memory 74. Thus, in accordance withanother embodiment of the invention, staging processor 107 receivesinstructions from schedule manager 155 such that its output ports areassigned to handle a predetermined category of programming contentprovided by the transport stream. For example, where content iscategorized by provider name, content type, program ID, etc., eachactive port may be assigned to handle one or more transport streams thatmake up one or more of such categories of content. Thus, for example,one output port—e.g., 109-1—may handle programming content provided byCNN and NBC, and another port—e.g., 109-2—may handle programming contentprovided by ABC, FOX and TNT.

As described above, schedule manager 155 is configured to controlstaging processor 107. In accordance with an aspect of the invention,schedule manager memory 74 stores instructions relating to which videoserver(s) 190-1 to 190-N should receive a given program, the number ofvideo servers that receive the content and where on the server theprogram is stored.

For example, effective processing of popular or high demand programmingis a business rule that is stored by business rule module 77 of schedulemanager memory 74. Thus, in accordance with an embodiment of theinvention, schedule manager 155 is configured to determine whichprograms are presently deemed popular—i.e., in higher demand by users.Such configuration may be implemented when the business rule relating tostorage based upon high demand programming (as stored by module 77) isinvoked. Depending on the level of popularity of the program, suchprogramming content may be stored on multiple video servers 190.

Thus, in accordance with an embodiment of the invention, schedulemanager 155 is configured to identify which programs are deemed mostpopular. Such determination may be determined, in accordance with anembodiment of the invention, by the number of requests received byheadend 22 generated by set-top terminals 18-1 through 18-M for the sameprogram. In an illustrative embodiment, the popularity of a program isdetermined based on viewing statistics, which are generated based ondata in requests issued from the set-top terminals 18-1 through 18-M ina service area. The requests may be issued in response to thesubscribers at one or more set-top terminals 18-1 through 18-M selectingand deselecting the program. For example, a program channel isconsidered popular when the number of set-top terminals receivingprogramming content associated with the program channel exceeds apredetermined threshold. This information may be provided to schedulemanager 155 for tracking which programs are deemed popular or in highdemand. Additional means may be used to identify high demand programmingcontent including, for example, heuristics.

It should be noted that requests received by headend 22 from set-topterminals 18-1 through 18-M may be communicated via a reverse passband,e.g., 5-40 MHz band, of a coaxial cable. The reverse passband comprisesreverse data channels (RDCs) having a 1 MHz bandwidth in this instance,through which quaternary phase shift keying (QPSK) signals containingupstream data are transmitted. It should be noted that the 1 MHzbandwidth allocated for an RDC here is for illustrative purposes only.It will be appreciated that a person skilled in the art may allocateother bandwidths therefor depending on the actual implementations. Aset-top terminal utilizes an RDC for sending both application data andcontrol messages. For example, the Digital Audio Visual Council (DAVIC),a standard setting organization, has defined a contention-based accessmechanism whereby multiple set-top terminals share an RDC. Thismechanism enables the set-top terminals to transmit upstream messageswithout a dedicated connection to a QPSK demodulator. The mechanism alsoprovides equal access to the set-top terminals that share the RDC, andenables detection and recovery from reverse path collisions that occurwhen two or more of the terminals transmit an upstream messagesimultaneously.

In accordance with another embodiment of the invention, whether aprogram is designated as popular or in high demand may also bedetermined by instructing schedule manager 155 to read metadata or asegmentation message that is transmitted within the downstream programstream as it is sent to staging processor 107. For example, asegmentation message may be associated with a program stream indicatingthat a given program is a prime time show or is anticipated to be inhigh demand because, for example, it is being broadcast for its firsttime. In addition, metadata may be inserted into the program streamindicating that the program associated with the metadata is in highdemand.

By providing staging processor 107 with a business rule that allprogramming designated as popular or in high demand be sent to apre-designated video server (e.g., server 190-1), control over thedestination of such content for storage is maintained. Thus, forexample, it may be desirable to send all programming that is designatedas popular or in high demand to a server that is deemed to be morereliable than others. By monitoring which programming content meets thiscategory and identifying which servers are deemed most suitable (interms of, e.g., speed, storage reliability, output capability),scheduling manager 155 can instruct staging processor 107 to direct theprogramming content to the appropriate server.

Additionally, a protocol may be defined such that certain programmingcontent is to be stored in one or more video servers 190 that have ahigher output capability. Such storage protocol may be implemented whenthe pertinent business rule relating thereto (as stored in module 77) isinvoked. Thus, in accordance with an embodiment, schedule manager 155stores information in schedule manager memory 74 that, among otherthings, provides the output capabilities of the video servers 190-1through 190-N that are in communication with staging processor 107 viaports 109-1 through 109-N. Moreover, the programming content may bestored in the respective video servers 190-1 through 190-N in a mannersuch that programming content can be made more readily available uponthe request for a certain program.

In addition to program popularity, schedule manager 155 may beconfigured to identify other characteristics of programs received bystaging processor 107, such as program type or program source (i.e.,content provider). This information may be ascertained by reading one ormore segmentation messages carried in the program stream or by accessingtable 400 stored by schedule manager 155. Such configuration may beimplemented when the business rule relating to storage based uponprogram type or program source (as stored in module 77) is invoked.Schedule manager 155 may then direct files storing programming contentto a video server based upon program type and/or program source, therebyenabling video servers 190-1 to 190-N to store programming based uponsuch characteristic(s). By enabling programming content to be stored ina logical manner, such as by programming content, program type, contentprovider, and the like, operation and maintenance of cable system 14 isfacilitated. Thus, if a system administrator needs to perform a givenoperation with respect to system 14 that relates to the storage ofprogramming content on one of the system's video servers 190, access tothe programming content by the administrator is facilitated by havingthe programming content logically organized. For example, by having alladvertising content stored on a specific server or set of servers, anadministrator of cable system 14 can more easily access and handle suchcontent.

In accordance with another embodiment of the invention, schedule manager155 may direct programming content to video servers 190-1 through 190-Nbased upon other characteristics or considerations, including whetherthe program is “premium” content (i.e., content for which additionalfees may be charged) which may be stored on a server having, forexample, high reliability, or free TV content which may be stored on aserver of lesser reliability.

In addition, programming content may be logically stored in one or morevideo servers 190-1 through 190-N in a manner in which such content maybe accessed in an efficient manner. Thus, in addition to identifyingwhich of the available video servers 190-1 through 190-N is to receivespecified programming content, scheduling manager 155 is also configuredto provide instructions to video servers 190-1 through 190-N regardingthe manner in which the content is stored by such server. In addition,each of these video servers 190-1 through 190-N may be instructed toredistributing programming content within its respective server asprogramming content is added to or removed from such server.

It should be noted that although the examples provided above relate tocircumstances when content is being transmitted to only one output port,staging processor CPU 23 may be instructed by scheduling manager 155 tosend the same programming content to multiple output ports. Suchconfiguration of sending the same programming content to multiple outputports increases content transmission reliability by redundancy. Forexample, if the same programming content is directed to two output ports(let's say ports 109-1 and 109-2), and congestion or a failure occurs atone of the two ports (e.g., port 109-1), but not the other port (e.g.,port 109-2), the transmitted programming content will not besubstantially delayed by the congestion or failure condition at port109-1. Thus, another business rule stored by business rule module 77 ofscheduling manager memory 74 relates to implementing redundancyprotocols to increase transmission reliability.

By directing the transmission of programming content to one or moreoutput ports 109-1 through 109-N as determined by CPU 23, stagingprocessor 107 can effectively handle a large volume of program streamsand, in many instances, congestion and failure may be reduced byintelligently sharing the transmission of program streams among activeoutput ports.

In addition to dictating which output port handles programming contentreceived by headend 22, EMI 120 may also provide staging processor 107with destination management protocols, such as the Interactive ServiceArchitecture Common Object Request Broker Architecture (CORBA) model,thereby enabling programming content to be intelligently distributedamong a plurality of video servers 190-1 to 190-N for ultimatetransmission to users.

The transfer of programming content to a video server—such as videoserver 190-1—is performed over cable system 14 in real-time in whichstaging processor interface 25 uses a standard file transfer protocolsuch as NFS, ftp, I-SCSI, or the like. This real-time transfer may beaccomplished as minimal buffering between staging processor 107 and thedestination server, such as video server 190-1, resulting from theintelligent distribution of programming content as described herein.Additional buffering may be added to support situations of destinationvideo server failure.

In addition, programming content that is processed by staging processor107 (e.g., formatting, generating trick files, etc.) may be converted tofiles and transferred to one or more video servers 190-1 through 190-Non a non-real-time basis.

Monitoring by the Staging Processor and EMI

Staging processor 107 may be configured to monitor for failures ordelays with respect to the receipt, processing or transmission ofprogramming content. In an embodiment of the invention, stagingprocessor 107 monitors the processing of such content and EMI 120 isconfigured for providing data concerning, for example, alerts orinstructions, in response to the monitoring by staging processor 107.For example, referring to FIG. 5, processor 107 may be configured tomonitor whether transmission of programming content to staging processor107—or a given port of staging processor 107—is delayed by apredetermined amount of time (such as 3-5 seconds) (steps 510 and 520)indicating that the staging processor 107 or at least one of its portshas become inactive. This may be accomplished, in accordance with andembodiment of the invention, by detecting whether packets are beingreceived. No packets being received for the predetermined period mayresult from, e.g., the cable to staging processor 107 being disconnectedor a failure by staging processor 107. EMI 120, in accordance with anembodiment of the invention, may be configured to poll staging processor107 to ensure that it is properly receiving data as described below.

Thus, if, for example, EMI 120 is informed of a delay in transmission ofprogramming content, wherein the delay is greater than, for examplethree seconds, an alarm is generated by EMI 120 (step 530). In an aspectof the invention, the alarm informs an administrator of system 14 of thedelay in transmission by staging processor 107.

In accordance with another embodiment of the invention, CPU 23 ofstaging processor 107 may instruct EMI 120 to generate an alarm if it isexpecting staging processor CPU 23 to generate a subsequent I-framebased upon a previously transmitted I-frame. Staging processor 107 maybe configured to monitor for the next I-frame by knowing thepredetermined frequency in which I-frames are received. With such aprocess, staging processor 107 is configured to expect the receipt ofI-frames at the predetermined frequency. In accordance with anembodiment of the invention, if one or more I-frames are not receivedwithin such predetermined frequency, an alarm is generated by EMI 120indicating that a transmission failure may have occurred.

Staging processor 107 may also be configured to monitor for the receiptof other regularly received MPEG-2 program specific information, such asa program map table (PMT) reference. Staging processor 107 determineswhether such information is received at a predetermined frequency (e.g.,on the order of every 100 ms, or 200 ms, or the like). Such frequency isprogrammable and may be predefined by the administrator of system 14.For example, the PMT lists, for each program in a program stream, thecurrently available video, audio and data components. Optionaldescriptors can give additional details about a program or a component.If staging processor 107 detects that a PMT reference for a givenprogram is not received within the designated frequency, an alarm isgenerated by EMI 120 indicating that a transmission failure may haveoccurred.

In yet another embodiment of the invention, the frequency in whichMPEG-2 packets are delivered may also be monitored by staging processor107 to detect possible delay or failure of programming content delivery.Because transmission of packets carrying programming content data ismade using a predetermined standard, such as DVB or DHEI, packets areexpected at a given rate. Staging processor 107 may be configured tomonitor for the frequency in which such packets are received todetermine whether a transmission failure has occurred. In addition, inan embodiment of the invention, the packet ID for incoming packets maybe read by staging processor 107 to determine whether such packets arebeing received sequentially or whether the order of receiving suchpackets have been disturbed. Using one of the monitoring methodsdescribed above, an alarm is generated upon detecting a delay oromission with respect to frame, packet or PMT reference delivery—apartfrom whether there is a time delay in programming content transmission.

Segmenting Scrambled Content

Typically, the programming content that is received by headend 22 fromsources 12 is transmitted in a scrambled format. The scrambled contentis then stored on one or more servers 190-1 through 190-N for furthertransmission downstream to one or more terminals 18-1 through 18-M uponrequest by a user. By storing and transmitting scrambled content,security considerations are typically met since intercepting and copyingthe program material becomes more difficult as compared with contentthat is not scrambled.

Although scrambled programming content tends to be more secure, it alsotends to be less adaptable. For example, applying segmentation messagesto scrambled content can be more difficult than applying such messagesto descrambled programming content. In accordance with an embodiment ofthe invention, staging processor 107 may nevertheless be configured tosegment scrambled content. This is accomplished by, in one embodiment,utilizing a descrambled copy of the scrambled content as a guide tofacilitate scrambled programming content processing.

For example, referring to FIG. 6 a, staging processor 107 of headend 22receives a transport stream from, for example, origination system 20that contains programming content in a scrambled format (step 610). Aportion of such transport stream, denoted 6000, is illustrated in FIG. 6b.

Program stream 6000′ includes a portion of a B-frame (frame B₀₂₁₀₀₂),and a portion of another B-frame (frame B_(023110′)) and an I-frame(frame I_(01019′)) in between the illustrated B-frame portions. Each ofthese frames are made up of packets. Thus, for example, I-frameI_(01019′) comprises packets 6100′, 6101′, 6102′, 6103′, 6104′6105′,etc. As shown with respect to packet 6100′, for example, each packetcomprises a trailer 6100 a′, a payload 6100 b′ and a header 6100 c′. Theheader contains instructions about the data carried by the packet andincludes: the length of the packet; synchronization data that assistswith the matching of the packet with system 14; packet number whichidentifies a given packet, e.g. packet 6100′, within the sequence ofpackets; the protocol which defines the type of packet that is beingtransmitted; a destination address which identifies the destination ofpacket 6100′; and an originating address which identifies theorigination of packet 6100′.

Trailer 6100 a′ includes information indicating the end of the packet6100′.

Payload 6100 b′ comprises the content that is being carried andincludes, among other things, a portion of the data that makes upI-frame I_(01019′).

The scrambled programming content is duplicated and correspondingdescrambled programming content is generated by a conventionaldescrambling technique (step 615). Along with the programming contentreceived by staging processor 107, the program stream containing suchcontent may, in accordance with an embodiment of the invention, alsoinclude segmentation messages that are to be inserted in the scrambledprogramming content.

At step 620, staging processor CPU 23 monitors the incoming programstream for segmentation points in the program stream (i.e., points inthe stream to perform the insertion). Upon identifying a segmentationmessage, staging processor CPU 23 identifies the location, within thedescrambled programming content, that the received segmentation messageis situated (if the segmentation message is already inserted in theprogram stream when the program stream is received) or is to be inserted(if the segmentation message is received separately from the programstream) (step 630). At step 640, staging processor CPU 23 thenidentifies the corresponding location, within the scrambled programmingcontent, in which the segmentation message should be inserted. Thus, ineffect, the descrambled programming content is used by staging processor107 as a guide to identify the appropriate corresponding location forinserting a received segmentation message within the scrambledprogramming content.

In accordance with an embodiment of the invention, the descrambledprogramming content having segmentation messages inserted therein by CPU23 may be used as a guide for the insertion of segmentation messages ina scrambled program stream by counting the number of received packetsrespecting the descrambled programming content from a predeterminedstarting point and the number of packets from the corresponding startingpoint of the scrambled programming content.

It should be noted that, although the payload portion of a packet in thescrambled programming content is scrambled (as indicated by the shadedboxes of FIG. 6 b), the trailer and header is descrambled. Thus,corresponding starting points between the descrambled and scrambledprogramming content may be identified by comparing the header of thedescrambled content with the header of a corresponding packet associatedwith the descrambled programming content. Because each header contains aunique identifier, identifying the corresponding header for theduplicate stream—that is descrambled—may be effectuated. Thus, referringback to FIG. 6 b, program stream 6000′ illustrates a stream of packets(packets 6100′, 6101′, 6102′, 6103′, 6104′, 6105, etc.) in which thepayload is scrambled (such as payload 6100 b′), which corresponds and isaligned with program stream 6000 (having packets 6100, 6101, 6102, 6103,6104, 6105, etc.) wherein, for example, packet 6100 is completelydescrambled, including trailer 6100 a, header 6100 c, as well as payload6100 b. By identifying a correspondence between headers 6100 and 6100′,for example, staging processor CPU 23 can align the program streams forsegmentation.

In another embodiment of the invention, the correspondence betweenscrambled programming and descrambled programming content may bedetermined by CPU 23 utilizing the well known program clock record (PCR)provided in a packet's transport header adaptation field within thepackets' header, as such information within the header is maintaineddescrambled. The PCR is a record that serves as a clock for thetransmitted program stream. Thus, by identifying the PCR time value of apredetermined descrambled packet within the scrambled programmingcontent, the corresponding descrambled programming content may beidentified.

Once the segmentation point is identified in the scrambled programstream, staging processor 107 is able to insert segmentation messagesinto the scrambled content as desired.

Compensation for Delay in Transmission to Staging Processor

In accordance with an embodiment of the invention, staging processor 107can compensate for a delay in transmission of programming content toprocessor 107. A delay may arise for several reasons including datamissing from a transmission due to a temporary transmission failure fromorigination system 20 to headend 22, delay at the input of stagingprocessor 107, and the like.

FIG. 7 is a flowchart illustrating the process of compensating formissing or delayed programming content, in accordance with an aspect ofthe invention. As described above, by monitoring the reception ofarriving MPEG-2 data packets, segmentation messages, etc. (or the lackthereof), staging processor 107 itself can monitor for whether there isa delay in transmission of programming content (step 710). Upondetecting a delay in the delivery of programming content, stagingprocessor 107 creates, in an embodiment of the invention, stuffingpackets to fill in the content that is not received in a timely fashionor at all (step 720). Thus, these stuffing packets are, in oneembodiment, packets that carry no useful data but are used to maintain aconstant bit rate with a variable payload. By carrying stuffing bits,code words are inserted in a program stream and are then discarded,thereby maintaining the bit rate of the stream. In another embodiment ofthe invention null packets (i.e., packets that have header informationbut no payload) are used to fill in the content that is not received.

In accordance with an embodiment of the invention, when such a featureis activated, staging processor 107 may be configured to buffer apredetermined amount of a received program stream. If upon monitoringthe received segmentation messages, staging processor CPU 23 determinesthat a portion of the program stream is delayed, interrupted or skipped,staging processor CPU 23 generates stuffing packets to fill in themissing content.

In accordance with one embodiment of the invention, if the delay is lessthan a predetermined amount of time, the inserted stuffing packets maybe deleted from the program stream, prior to further transmission to,for example, video servers 190-1 through 190-N or set-top terminals 18-1through 18-M. Thus, for example, when a small delay occurs (e.g., a 500millisecond delay) (step 730), the stuffing packets that were insertedinto the stream as a result of the detected delay may be deleted and thereceived programming content from both before and after the delay may bemerged (step 740). In such circumstances, the delay in transmission isnot noticeable to the user as the delay in transmission was sufficientlybrief such that the programming content prior to and after the delaywere pieced together prior to downstream transmission from headend 22 toset-top terminal 18-1. If the delay exceeds the predetermined amount oftime, the provision of the stuffing packets is effectuated (step 750),which enables a more graceful failure of content delivery when a delayin receiving data that makes up a program stream occurs.

In another embodiment of the invention, other packets (besides, e.g.,null packets) may be used to create an image that is sent to terminal18-1, and viewed by users—in the form of a blank (or black) screen, astationary image (such as a picture), or a pre-packaged audio and/orvideo clip. In yet another embodiment of the invention, when a delay isrecognized, one of the I-frames that is received before the delay may berepeated to compensate for such delay.

Encapsulating MPEG-2 Formatted Transport Streams into UDP/IP Datagrams

As described above, the generated transport streams are typicallytransmitted from headend 22 to hub 24 via IP transport over opticalfiber. Content received by staging processor 107, however, may also berepackaged, or encapsulated, in a user datagram protocol/Internetprotocol (“UDP/IP”) datagram. Employing such datagrams typically reducesthe processing time to reassemble associated packets of a given programas compared with using other standard protocols, such as the Internetprotocol.

Video and audio data which is compressed in accordance with, forexample, the well known MPEG-2 standard, and which comprises theprogramming content information received and handled by stagingprocessor 107, are carried by continuous elementary streams,respectively, which are packetized, resulting in packetized elementarystreams (PESs). Staging processor 107 identifies these packets byheaders that contain time stamps for synchronization, and are used toform MPEG-2 formatted transport streams. For digital broadcasting,multiple programs and their associated PESs are multiplexed into atransport stream carrying a single program. A transport stream has PESpackets further subdivided into short fixed-size data packets, in whichmultiple programs encoded with different clocks can be carried. Atransport stream not only comprises a multiplex of audio and video PESs,but also other data such as MPEG-2 program specific information (“PSI”)describing the transport stream. The MPEG-2 PSI includes a programassociated table (“PAT”) that lists every program in the transportstream. Each entry in the PAT points to a program map table (PMT) thatlists the elementary streams making up each program. Some programs areopen, but some programs may be subject to conditional access(encryption) and this information is also carried in the MPEG-2 PSI.

The aforementioned fixed-size data packets in a transport stream eachcarry a packet identifier (“PID”) code. Packets in the same elementarystreams all have the same PID, so that a decoder can select theelementary stream(s) it needs and reject the remainder.Packet-continuity counts are implemented to identify discontinuity inthe desired stream.

In accordance with an embodiment of the invention, because generatedtransport streams are transmitted via Internet Protocol (“IP”)—e.g.,from headend 22 to hub 24—the transmitted data may be encapsulated usinga user datagram protocol (“UDP”). Such a protocol is transactionoriented, and delivery and duplicate protection may not be guaranteed.Nevertheless, such protocol provides a procedure for sending contentwith a minimum of protocol mechanisms. It should be noted that TCP/IPcan also be used to deliver data if content is being distributed acrossa wired network.

The user datagram—which in this case carries video content and audiocontent information—is typically made up of four fields which reside ina packet header (in addition to the data field that stores thetransmitted data). A source port field is an optional field for storinga port value which indicates the port of the sending processor. If thisfield is not used, a value of zero is inserted. A destination portidentifies the address to which the packet of data should betransmitted. A length field indicates the length in octets of thedatagram including the header and the data. A checksum field providesprotection against corrupted datagrams.

UDP provides a connectionless service that utilizes the IP protocol tosend the datagram. Unlike certain other protocols that deliver IPpackets (such as the Transmission Control Protocol (TCP)), UDP does notprovide sequencing of packets, relying on the higher layer protocols tosort information. Using UDP often reduces processing time because ofminimal reassembly time—particularly when the datagrams are small.

As described above, when staging processor 107 receives programmingcontent, it is typically received in accordance with the DVB-ASI or DHEIstandards. Such standards support serial point-to-point transport ofprogramming materials. By encapsulating programming content as a UDP/IPdatagram, a multicast IP header may be used, thereby directing datagramsto multiple devices, such as any number of video servers 190-1 through190-N. Accordingly, such a protocol allows simultaneous or almostsimultaneous delivery of received programming content to multipleprocessing devices, thereby creating an IP multicast.

The IP multicast operates based on a group concept. For example, a groupof servers, such as video servers 190-1 through 190-N, may be configuredto receive a particular data stream or substream using a well knownInternet Group management Protocol (IGMP). Such configuration enablesthese servers to be aware of IP multicast packets with a particulardestination address to which staging processor 107 can send the datastream. When packets are transmitted to the staging processor's outputports 109-1 through 109-N, the video servers 190-1 through 190-N readthem based on their destination address, which is a so-called “Class Daddress.” Specifically, each IP packet whose destination address startswith a certain value, for example “1110” is an IP multicast packet. Theremaining bits of a packet address may be used for identifying the groupof servers for which the packet is intended.

When one or more of servers 190-1 through 190-N are configured toreceive IP multicast packets and when IP multicast packets are madeavailable to these servers, a processor (not shown) in each such serverdetermines whether it is configured to read the received packets basedupon IP multicast packet's address.

Thus, referring to FIG. 8, the process for formatting programmingcontent that is received in a program stream by headend 22, inaccordance with an embodiment of the invention, is illustrated. At step810, upon receiving programming content in a DVB-ASI format, DHEIformat, or some other serial point-to point format, staging processorCPU 23 demultiplexes the program stream into substreams by, for example,specific program. This is accomplished as a result of CPU 23 reading theprogram identifier for each received packet and assigning packets havingcommon program identifiers to their own substream (as described morefully above). Each packet in each respective substream is thenencapsulated as a datagram (step 820) by staging processor 23 and eachUDP datagram is assigned by CPU 23 an IP multicast address (e.g., ClassD address) (step 830). The Class D address is read by servers 190-1through 190-N for determining which of these servers the packet isintended. As a result, a substream is created which is carrying contentrelating to, in this example, a single program.

Thus, one or more of video servers 190-1 through 190-N reads the datapackets for which an IP multicast is established and may store suchpackets for storage. Accordingly, transmission of such programmingcontent requires a relatively small amount of processing as theprogramming content is encapsulated in its own substream and supports amulticast transmission.

By employing a UDP/IP protocol (as opposed to, for example, the TCP/IPprotocol), the scalability of staging processor 107 increases. In otherwords, if one of such processor 107 goes out of service, system 14 canaccess another staging processor that is made available to system 14.The increased scalability also allows load-balancing among availablestaging processors. Accordingly, the implementation of the UDP/IPprotocol obviates the need to replicate the transmitted content streamwhen such redundancy is required or load balancing is desired. Thus, anassigned port value can be used by staging processor 107 to forwarddatagrams to other staging processors (not shown) for sharing in theprocessing of received programming content that is repackaged in thedatagrams.

The foregoing merely illustrates the principles of the invention. Itwill thus be appreciated that those skilled in the art will be able todevise numerous other arrangements which embody the principles of theinvention and thus within the spirit and scope of the invention, whichis defined in the claims, below.

For example, staging processor 107 is described above as affording bothmedia processing and content segmentation capabilities. Such aconfiguration is illustrated in FIG. 1B as a monolithic device—i.e.,such dual functionality is contained within a single physicalembodiment. In another embodiment, the media processing functionality isseparated from the segmentation control processing, includingsegmentation message detection and segmentation and file transfer. Thus,turning to FIG. 9, headend 22 a is illustrated having the samecomponents and functionality as that of headend 22 of FIG. 1 b, exceptthat staging processor 107 of FIG. 1 b is replaced by media processor902 and segmentation processor 904, wherein these components areconnected to one another and other components of headend 22 a byEthernet connections.

In yet an alternate embodiment, multiple media processors 902-1 through902-Q, where Q is an integer, and multiple segmentation processors 904-1through 904-R, where R is an integer, are utilized, and areinterconnected by, for example, Ethernet connections. Such anarrangement allows for effective load-balancing, redundancy and back-uparrangements. It should be noted that, although in FIG. 10 each of themedia processors are connected to each of the segmentation processors, aconfiguration may be implemented wherein each media processor isconnected to at least one segmentation processor, but not necessarilyall of them.

1. A method for processing a program stream, comprising: receiving aprogram stream, a segment of the program stream comprising a first totalnumber of frames, the first total number of frames comprising at leastone intracoded frame and at least one interframe, the program streamfurther comprising at least one segmentation message containinginstructions for processing the program stream at a location in thesegment defined by the at least one segmentation message; constructingat least one additional intracoded frame, at least in part, from contentof at least one of the first total number of frames in the segment ofthe received program stream; inserting the at least one additionalconstructed intracoded frame at the defined location in the segment,increasing the first total number of frames in the segment to a secondtotal number of frames greater than the first total number of frames;and after inserting the at least one additional intracoded frame,processing the program stream at the defined location pursuant to theinstructions.
 2. The method of claim 1, wherein the first total numberof frames in the segment comprises a plurality of interframes.
 3. Themethod of claim 2, further comprising reformatting at least one of theinterframes following an inserted additional intracoded frame in thesegment, prior to processing the program stream at the defined location.4. A system for processing a program stream, comprising: an interfacefor receiving a program stream, a segment of the program streamcomprising a first total number of frames, the first total number offrames comprising at least one intracoded frame and at least oneinterframe, the program stream further comprising at least onesegmentation message containing instructions for processing the programstream at a defined location in the program stream; and, at least oneprocessor for: constructing at least one additional intracoded frame, atleast in part, from content of at least one of the first total number offrames in the segment of the received program stream; inserting the atleast one additional constructed frame at the defined location in thesegment, increasing the first total number of frames in the segment to asecond total number of frames greater than the first total number offrames; and processing the program stream at the defined locationpursuant to the instructions, after inserting the at least oneadditional constructed intracoded frame.
 5. The system according toclaim 4, wherein the first total number of frames in the segmentcomprises a plurality of interframes.
 6. The system according to claim5, further comprising reformatting at least one of the interframesfollowing an inserted additional intracoded frame in the segment, priorto processing the program stream at the defined location.
 7. The methodof claim 1, comprising constructing the at least one additionalintracoded frame from content of at least one interframe proximate thedefined location in the segment.
 8. The system of claim 4, comprisingconstructing the at least one additional intracoded frame from contentof at least one interframe proximate the defined location in thesegment.
 9. A system for processing a program stream, comprising: meansfor receiving a program stream, a segment of the program streamcomprising a first total number of frames, the first total number offrames comprising at least one intracoded frame and at least oneinterframe, the program stream further comprising at least onesegmentation message containing instructions for processing the programstream at a location defined by the at least one segmentation message;means for constructing at least one additional intracoded frame, atleast in part, from content of at least one of the first total number offrames in the segment of the received program stream; means forinserting the at least one additional constructed intracoded frame atthe defined location in the segment of the program stream, increasingthe first total number of frames in the segment to a second total numberof frames greater than the first total number of frames; and means forprocessing the program stream at the defined location pursuant to theinstructions, after inserting the at least one additional constructedintracoded frame.
 10. A method for processing a program streamcomprising: receiving an encoded program stream comprising a pluralityof groups of pictures (“GOPs”), each GOP comprising a first total numberof frames, the first total number of frames comprising at least oneintracoded frame and a plurality of interframes, the program streamfurther comprising at least one segmentation message containinginstructions for processing the program stream at a location within arespective GOP defined by the at least one segmentation message;constructing at least one additional intracoded frame, at least in part,from content of at least one of the first total number of frames in theGOP; inserting the at least one additional constructed intracoded frameat the defined location within the respective GOP, such that therespective GOP comprises a second total number of frames greater thanthe first total number of frames; reformatting at least one interframefollowing the inserted additional intracoded frame in the respective GOPbased, at least in part, on the inserted additional intracoded frame;and processing the program stream at the defined location pursuant tothe instructions, after reformatting the at least one interframe. 11.The method of claim 10, further comprising: reformatting at least onesecond interframe within the GOP following the inserted additionalconstructed intracoded frame based, at least in part, on the at leastone reformatted interframe, prior to processing the program stream atthe defined location.
 12. The method of claim 1, wherein the receiving,constructing, inserting, and processing are conducted by at least oneprocessor in a headend of a cable television system.
 13. The system ofclaim 4, further comprising a headend of a cable television system, theheadend comprising the interface and the processor.
 14. The method ofclaim 10, wherein the receiving, constructing, inserting, reformatting,and processing are conducted by at least one processor in a headend of acable television system.
 15. The method of claim 10, comprisingconstructing the additional intracoded frame, at least in part, fromcontent of an intracoded frame preceding the location.
 16. The method ofclaim 15, comprising constructing the additional intracoded frame, atleast in part, from content of at least one interframe following thedefined location.
 17. The method of claim 10, further comprisingrequantizing the at least one reformatted interframe.
 18. The method ofclaim 1, wherein the segment comprises a group of pictures (GOP). 19.The method of claim 1, further comprising: determining whether toincrease temporal resolution in the segment, and if so, thenconstructing the at least one additional reference frame.
 20. The methodof claim 1, comprising constructing the additional intracoded frame, atleast in part, from content of at least one interframe preceding thedefined location.
 21. The method of claim 20, comprising constructingthe additional intracoded frame, at least in part, from content of atleast one interframe following the defined location.
 22. The method ofclaim 3, further comprising: requantizing the reformatted interframes.23. The system of claim 4, wherein the segment comprises a group ofpictures (GOP).
 24. The system of claim 4, wherein the processorfurther: determines whether to increase temporal resolution in thesegment and, if so, then constructs the at least one additionalreference frame.
 25. The system of claim 4, comprising constructing theadditional intracoded frame, at least in part, from content of at leastone interframe preceding the defined location.
 26. The system of claim25, comprising constructing the additional intracoded frame, at least inpart, from content of at least one interframe following the definedlocation.
 27. The system of claim 6, further comprising: requantizingthe reformatted interframes.
 28. A method for processing a programstream, comprising: receiving a program stream comprising a plurality ofintracoded frames and a plurality of interframes; creating at least oneadditional intracoded frame at a defined location in the program stream;reformatting at least one interframe following the created additionalintracoded frame in the program stream; and processing at least aportion of the program stream including the defined location, afterreformatting the at least one interframe.
 29. The method of claim 28,comprising: processing at least the portion of the program stream bycreating a fast-forward file and a rewind file based, at least in part,on at least the portion of the program stream.
 30. The method of claim28, wherein the program stream comprises at least one segmentationmessage containing instructions for processing the program stream at thedefined location.
 31. The method of claim 28, further comprising:reformatting at least one additional interframe following the definedlocation based, at least in part, on at least one reformattedinterframe.
 32. The method of claim 28, further comprising: requantizingthe at least one reformatted interframe.
 33. The method of claim 28,further comprising: determining whether to increase temporal resolutionin the segment, and if so, then creating the at least one additionalreference frame at the defined location.
 34. A system for processing aprogram stream, comprising: an interface for receiving a program streamcomprising a plurality of intracoded frame and a plurality ofinterframes; and at least one processor for: creating at least oneadditional intracoded frame at a defined location in the program stream;reformatting at least one interframe following the created additionalintracoded frame in the program stream; and processing at least aportion of the program stream including the defined location, afterreformatting the at least one interframe.
 35. The system of claim 34,wherein the processor processes the program stream by creating afast-forward file and a rewind file based, at least in part, on theportion of the program stream.
 36. The system of claim 34, wherein theprogram stream comprises at least one segmentation message containinginstructions for processing the program stream at the defined location.37. The system of claim 34, wherein the processor further reformats atleast one interframe following the defined location based, at least inpart, on at least one reformatted interframe.
 38. The system of claim34, wherein the processor further requantizes the at least onereformatted interframe.
 39. The system of claim 34, wherein theprocessor further determines whether to increase temporal resolution inthe segment, and if so, then the processor creates the at least oneadditional reference frame at the defined location.